A Time-dependent Stopping Problem with Application to Live Organ Transplants

نویسندگان

  • Israel David
  • Uri Yechiali
چکیده

We consider a time-dependent stopping problem and its application to the decision-making process associated with transplanting a live organ. "Offers" (e.g., kidneys for transplant) become available from time to time. The values of the offers constitute a sequence of independent identically distributed positive random variables. When an offer arrives, a decision is made whether to accept it. If it is accepted, the process terminates. Otherwise, the offer is lost and the process continues until the next arrival, or until a moment when the process terminates by itself. Self-termination depends on an underlying lifetime distribution (which in the application corresponds to that of the candidate for a transplant). When the underlying process has an increasing failure rate, and the arrivals form a renewal process, we show that the control-limit type policy that maximizes the expected reward is a nonincreasing function of time. For non-homogeneous Poisson arrivals, we derive a first-order differential equation for the control-limit function. This equation is explicitly solved for the case of discrete-valued offers, homogeneous Poisson arrivals, and Gamma distributed lifetime. We use the solution to analyze a detailed numerical example based on actual kidney transplant data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Outcomes of shipped live donor kidney transplants compared with traditional living donor kidney transplants.

The disparity between kidney transplant candidates and donors necessitates innovations to increase organ availability. Transporting kidneys allows for living donors and recipients to undergo surgery with a familiar transplant team, city, friends, and family. The effect of shipping kidneys and prolonged cold ischemia time (CIT) with living donor transplantation outcomes is not clearly known. Thi...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

متن کامل

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations research

دوره 33 3  شماره 

صفحات  -

تاریخ انتشار 1985